Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
Peer-to-Peer (P2P) systems are generally known as open and free systems since resources are often contributed from voluntary participants. Their limitation, however, is that they only support simple resource sharing such as file (storage) sharing and bandwidth sharing. On the other hand, based on virtualization techniques, cloud computing provides a more flexible mechanism to share all types of resources...
Data-centric network plays an important part in the next generation network architecture. And name system is one of basic elements in data-centric network. This paper describes an approach which achieves the name system design criterion. In naming, a combination of three entities is used to achieve security, scalability, and flexibility. In name resolution, a three-layer structure is proposed to achieve...
This paper elicits and models the requirements of a decentralized carbon emissions trading platform (CarboCoin). CarboCoin platform is based on the Bit coin, a peer-to-peer digital currency with no central authority. CarboCoin is focused on providing high privacy protection for participants in order to encourage more engagement in carbon emissions reduction process. CarboCoin requirements are elicited...
In Chord protocol of P2P network, distances between entries in routing table are too long and only half of the identifier space can be covered. To solve this problem, a higher order Chord routing algorithm is proposed. The algorithm presents a new structure formula for routing table, increases distribution density of routing table entries, and extends routing searching coverage areas to the entire...
In this paper we discuss the issues relating to architecture formation in MMOGs and the two principal design choices that must be made when constructing a Peer-to-Peer (P2P) MMOG: the Area of Interest Management (AoIM) scheme and the distribution and communication mechanism. We introduce an updated survey of the state-of-the-art of AoIM in P2P Online Games. We identify key issues in the development...
In tactical environment, MANET (Mobile Ad Hoc Network) has the network characteristics which make highly dynamic nodes, self-organized in fully-distributed style. Also, it has a harsh wireless channel environment compared to the commercial networks. In these channel environments, optimal path decision suited for Quality of Service (QoS) of transmitted tactical traffics must be performed by recognizing...
Due to extensive coverage and domains of cloud computing-based architecture, most users saves and access highly similar data because of user habits and available resources. Supposing the data stored in the storage devices is of high duplication and similarity, the system administrator cannot guarantee that every node (peer) in the cloud computing system can maintain the best status for data integration...
This article presents an architecture for research and development of peer-to-peer (P2P) systems. A complete P2P application has to cope with problems such as NAT-traversal, bootstrapping, connection management, routing, storage, and security. Therefore, our approach separates the system into layers and components. A developer can easily build a complete P2P stack by plugging layers and components...
Locality-aware P2P file sharing systems have drawn the attention of the research community as a promising technique to alleviate the tussle between P2P traffic and ISPs. However, existing locality-based schemes mainly focus on how to distinguish whether a peer is local or not and pay less attention to how to utilize the locality information. Typically, they simply bias the peer selection towards local...
In this paper, we propose CStorage a fully distributed and efficient data storage scheme for wireless sensor networks (WSNs) based on compressive sensing (CS) techniques. CStorage requires much smaller number of transmissions compared to existing algorithms by exploiting the compressibility of the natural signals along with the broadcast property of wireless channels. In CStorage, after the probabilistic...
In today's Internet, many peer-to-peer (P2P) applications deploy their distributed networks based on Kademlia, a robust distributed hash table (DHT) protocol. Since Kademlia has no mechanism to defend ID fraud, Sybil attack becomes a great threat on these P2P networks. However, to our best knowledge, Sybil attacks in real Kademlia-based networks has never been measured. In this paper, based on our...
In the IEEE 802.16j standard, the relay station has been introduced to increase the coverage and the throughput of WiMAX networks. The placement of the relay station plays a critical role in the system performance and therefore draws tremendous attention from the research community. In this paper, we study the relay station placement problem in the WiMAX network, with the cooperative communication...
This paper presents a solution for a new multidimensional packet classifier of an edge router, based on content — related new fields embedded in the data packets. The technique is applicable to content aware networks. The classification algorithm is using three new packet fields named Virtual Content Aware Network (VCAN), Service Type (STYPE) and U (unicast/multicast) which are part of the Content...
In this paper, we describe an improved model Kad-D based on Kademlia[1]. The networks based on Kademlia are not stabilized at all times, for all kinds of nodes in the networks connected to the networks can be cut out of networks frequently. And in mobile environments that are made of intermittent connections and unsettled networks bandwidths, the Kademlia has good performance but the hops, delay and...
This paper proposes an efficient contents sharing strategy using differences between their versions in Peer-to-Peer (P2P) networks. In this strategy, when a user requests a content item, he/she can get it by retrieving the other version of the content item and the difference from the requested version of the item, if the obtaining cost of the requested version of the content item is expensive. Furthermore,...
Within the G-Lab project we consider a Future Internet which does not consist of a single general-purpose network architecture. Instead, multiple coexisting virtual networks are designed to cater for the needs of different use-cases and applications. Each of these application-tailored networks requires application-tailored protocols in order to realize the network specific functionalities and characteristics...
Microblogging has become an important part of the social web evolution and is being utilized in many aspects such as advertising, political campaigns, and popular uprisings. Due to its heavy centralization, many have proposed decentralized alternatives based on a variety of models. This paper suggests a fully distributed approach built on top of existing peer-to-peer technologies. We demonstrate that,...
In this paper, we propose a methodology for optimal image transmission over a VSNs (Visual Sensor Networks) via cross-layer optimization. Toward this goal, we control the compression ratio of a captured image and network parameters such as source rate, flow rate and routing path. In particular, since this scheme is based on distributed optimization, we can avoid energy concentration in a specific...
BitTorrent(BT) has emerged as one of the most popular protocols for content sharing in recent years. Most BT applications are network-oblivious which brings great challenges to traffic engineering. As basic input information, network-wide BT traffic distribution is of vital importance for service providers (SP) or carriers to enforce appropriate control policies. Direct online measurement of network-wide...
In this work we propose a novel probabilistic flooding strategy for unstructured p2p networks. Our strategy takes into account the popularity of resources and the hop distance from the node that initiated the query. The latter is used to estimate the number of nodes reached by the query message. Based on the above parameters we adjust the forwarding probability at the time a node receives the query...
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.